The congestion of n-cube layout on a rectangular grid

نویسندگان

  • Sergei L. Bezrukov
  • Joe D. Chavez
  • L. H. Harper
  • Markus Röttger
  • Ulf-Peter Schroeder
چکیده

We consider the problem of embedding the n-dimensional cube into a rectangular grid with 2n vertices in such a way as to minimize the congestion, the maximum number of edges along any point of the grid. After presenting a short solution for the cutwidth problem of the n-cube (in which the n-cube is embedded into a path), we show how to extend the results to give an exact solution for the congestion problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilayer VLSI Layout for Interconnection Networks

Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-layer model, the layout area for a variety of networks can be reduced by a factor of about L 2 2 compared to the layout area required under a 2-layer model, and the volume and maximum wire length can be reduced by a fac...

متن کامل

Dominance rules for the optimal placement of a finite-size facility in an existing layout

In this paper, we consider the problem of optimal placement of a single finite-size, rectangular facility in presence of other rectangular facilities. There is a non-negative interaction between the new and existing facilities as well as pairs of existing facilities. All interactions are serviced through a finite number of input/output points located on the boundary of each facility. We assume ...

متن کامل

E cient Parallel Algorithms for Two Graph Layout Problems

We present e cient parallel algorithms for solving two graph layout problems: Find a F ary Embedding on a grid and construct a rectangular dual for planar graphs. The algorithm for the rst problem takes O(logn log n) time with O(n) processors on a PRAM. The algorithm for the second problem takes O(log 2 n) time with O(n) processors.

متن کامل

Stochastic Facility Layout Planning Problem: A Metaheuristic and Case Study

Facility layout is one of the most important Operations Management problems due to its direct impact on the financial performance of both private and public firms. Facility layout problem (FLP) with stochastic parameters, unequal area facilities, and grid system modeling is named GSUA-STFLP. This problem has not been worked in the literature so that to solve GSUA-STFLP is our main contribution....

متن کامل

Transmission Congestion Management Considering Uncertainty of Demand Response Resources’ Participation

Under the smart grid environment, demand response resources (DRRs) are introduced as a virtual power plant to enhance power system adequacy. DRRs often fail to reduce their load due to some external factors. In this paper, a reliability model of a DRR is constructed as multi-state conventional generation units, where the probability, frequency of occurrence, and departure rate of each state can...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 213  شماره 

صفحات  -

تاریخ انتشار 2000